Deadlock Free Routing on a Ring: A Performance Evaluation

نویسندگان

  • Zhen Liu
  • Philippe Mussi
چکیده

This paper is concerned with the performance analysis of a deadlock free protocol for limited capacity ring networks. There are ¡ nodes on the ring. Each node is connected with an emitter and a receiver of messages and is equiped with a buffer of capacity two for receiving and transmitting messages. The ring is of uni–direction so that every node has a communication predecessor and a successor. The system is modeled by a queueing system with finite capacities and blockings. An approximate analysis is provided for computing various performance measures, such as throughput, mean sojourn time of messages, and mean number of messages on the ring. Techniques in use are based on aggregation of Markov chains. Marginal queue length probability distributions are directly derived from aggregated state transition probabilities. Résumé : Ce rapport est consacré a ` l'e ´valuation des performances d'un protocole de routage sans blocage pour les réseaux en anneau a ` capacité limitée. Chacun des ¡ noeuds de l'anneau est connecté a ` un e ´metteur et un récepteur de messages et est muni d'un tampon de messages de capacité deux. L'anneau est uni-directionnel et travaille en temps discret. Au début de chaque période de temps, un noeud peut recevoir un message de son e ´metteur ou de son prédécesseur, et peut transmettre un message a ` son successeur ou a ` son récepteur. Un message ne peut e ˆtre transmis au successeur que si ce dernier n'est pas saturé. Nous supposons e ´galement qu'un noeud ne peut recevoir de messages de son e ´metteur que si son tampon est vide. Ce système est modélisé par un réseau de files d'attente avec blocages et ca-pacités limitées. Grâce a ` une analyse approchée, nous calculons diverses mesures de performance, telles que le débit, le temps moyen de séjour des messages, le nombre moyen de messages sur l'anneau. Les techniques utilisées sont basées sur l'aggrégation des chaıˆnes de Markov. Les distributions de probabilité des longueurs de files sont directement déduites des probabilités de transition des e ´tats aggrégés.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Red Rover Algorithm for Deadlock-Free Routing on Bidirectional Rings

An algorithm for deadlock-free routing in bidirectional ring structures in multicomputer networks is presented. This algorithm provides greater throughput and lower message latencies than those of previously presented ring routing algorithms. Insight into these results is given by a message traÆc analysis, and increased performance for wormhole-routed networks is quanti ed through simulation ex...

متن کامل

CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...

متن کامل

APSRA: A methodology for design of Application Specific Routing Algorithms for NoC Systems

A future NoC architecture must be general enough to allow volume production and must have features to specialize and configure to match and meet application’s performance requirements. In this report, we present a methodology to specialize the routing algorithm in NoC routers to optimize its communication performance while ensuring deadlock free routing. Duato’s theory of deadlock free routing ...

متن کامل

Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks

The InfiniBand Architecture (IBA) defines a switchbased network with point-to-point links whose topology is arbitrarily established by the customer. Often, the interconnection pattern is irregular, which complicates routing and deadlock avoidance. Current routing algorithms for NOWs, either achieve a low network performance, such as the up*/down* routing scheme, or cannot be implemented on IBA ...

متن کامل

Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks

Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of deadlock-free routing algorithms. More recently, deadlock recovery strategies have begun to gain acceptance. In particular, progressive deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver deadlocked packets, instead of k...

متن کامل

Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches

ÐCut-through switching promises low latency delivery and has been used in new generation switches, especially in high speed networks demanding low communication latency. The interconnection of cut-through switches provides an excellent network platform for high speed local area networks (LANs). For cost and performance reasons, irregular topologies should be supported in such a switch-based net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994